A Simple Sequential Algorithm for Approximating Bayesian Inference Elizabeth Bonawitz, Stephanie Denison, Annie Chen, Alison Gopnik, & Thomas L. Griffiths {liz b, smdeniso, c annie, gopnik, tom griffiths}@berkeley.edu De

Source URL: ccdlab.rutgers.edu

• Statistics
• Sampling techniques
• Statistical mechanics
• Stochastic simulation
• Statistical theory
• Statistical inference
• Bayesian inference
• Bayesian network
• Particle filter
• Bayesian probability
• Monte Carlo method
• Bayesian statistics

A Simple and Practical Algorithm for Differentially Private Data Release Moritz Hardt IBM Almaden Research San Jose, CA

Source URL: users.cms.caltech.edu

Estimating Learning Rates in Evolution and TDL: Results on a Simple Grid-World Problem Simon M. Lucas Abstract— When learning to play a game or perform some task, it is important to learn as quickly and effectively as

Source URL: game.itu.dk

• Applied mathematics
• Cybernetics
• Machine learning
• Cognitive science
• Evolution
• Genetic algorithms
• Mathematical optimization
• Q-learning
• Reinforcement learning
• Artificial neural network
• Evolutionary computation
• Evolutionary algorithm

Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Alekh Agarwal Microsoft Research, New York, NY ALEKHA @ MICROSOFT. COM

Source URL: homepages.math.uic.edu

Simple Motivating Example Likelihood and the Missing Data Problem The EM Algorithm and Amelia An Example in Amelia Section 12: Missing Data1 April 19, 2012

Source URL: www.jenpan.com

Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits arXiv:1402.0555v1 [cs.LG] 4 FebAlekh Agarwal1 , Daniel Hsu2 , Satyen Kale3 , John Langford1 , Lihong Li1 , and

Source URL: arxiv.org

• Analytic number theory
• Prime-counting function
• Valuation

SOS Lecture 6: The SOS approach to refuting the UGC / Boaz Barak Morally speaking, the Unique Games Conjecture (UGC) asserts that a simple algorithm— namely the degree 2 SOS program— is the optimal efficient algorith

Source URL: www.boazbarak.org

A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints T. K. Satish Kumar?† , Duc Thien Nguyen‡ , William Yeoh†† , and Sven Koenig† † Department of Computer Science

Source URL: www.cs.nmsu.edu

A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗ Mark Johnson Brown Laboratory for Linguistic Information Processing Brown University Mark

Source URL: web.science.mq.edu.au

Paxos Made Simple Leslie Lamport 01 Nov 2001 Abstract The Paxos algorithm, when presented in plain English, is very simple.

Source URL: www.news.cs.nyu.edu